An iterative test for H-matrix
نویسندگان
چکیده
منابع مشابه
An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملOn the modified iterative methods for $M$-matrix linear systems
This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کاملH−/H∞ structural damage detection filter design using an iterative linear matrix inequality approach
The existence of damage in different members of a structure can be posed as a fault detection problem. It is also necessary to isolate structural members in which damage exists, which can be posed as a fault isolation problem. It is also important to detect the time instants of occurrence of the faults/damage. The structural damage detection filter developed in this paper is a model-based fault...
متن کاملTwo Iterative Schemes for an H-system
Two iterative schemes for the solution of an H-system with Dirichlet boundary data for a revolution surface are studied: a Newton imbedding type procedure, which yields the local quadratic convergence of the iteration and a more simple scheme based on the method of upper and lower solutions.
متن کاملAn Algebraic Approach for H-matrix Preconditioners∗
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebraic approach to constructing H-matrices which combines multilevel clustering methods with the H-matrix arithmetic to compute the H-inverse, H-LU, and the H-Cholesky factors of a matrix. Then the H-inverse, H-LU or H-Chol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2000
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(99)00303-9